A family of groups with nice word problems
نویسندگان
چکیده
منابع مشابه
Characterizing Word Problems of Groups
The word problem of a finitely generated group is a fundamental notion in group theory; it can be defined as the set of all the words in the generators of the group that represent the identity element of the group. This definition allows us to consider a word problem as a formal language and a rich topic of research concerns the connection between the complexity of this language and the algebra...
متن کاملSpace Complexity and Word Problems of Groups
In this section we will give an overview of the paper; precise definitions of the terms used here will be found in Sections 2, 3 and 4. Our starting point is that there are several intriguing links between group theory and formal language theory. One of the many interesting such connections is the consideration of which groups G have a word problem lying in a particular class F of formal langua...
متن کاملCooperative Peer Groups in NICE
We present a distributed scheme for trust inference in peer-to-peer networks. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify non-cooperative...
متن کاملA new family in the stable homotopy groups of spheres
Let $p$ be a prime number greater than three. In this paper, we prove the existence of a new family of homotopy elements in the stable homotopy groups of spheres $pi_{ast}(S)$ which is represented by $h_nh_mtilde{beta}_{s+2}in {rm Ext}_A^{s+4, q[p^n+p^m+(s+2)p+(s+1)]+s}(mathbb{Z}_p,mathbb{Z}_p)$ up to nonzero scalar in the Adams spectral sequence, where $ngeq m+2>5$, $0leq sExt}_A^{s+2,q[(s+2)p...
متن کاملThe bounded and precise word problems for presentations of groups
We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE. The main technical result of the paper states that, for certain finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1974
ISSN: 0004-9735
DOI: 10.1017/s144678870001805x